Leapfrog fullerenes have many perfect matchingsDOSLIC, Tomislav.Journal of mathematical chemistry. 2008, Vol 44, Num 1, pp 1-4, issn 0259-9791, 4 p.Article

GRAPHS HAVING SMALL NUMBER OF SIZES ON INDUCED k-SUBGRAPHSAXENOVICH, Maria; BALOGH, Jozsef.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 264-272, issn 0895-4801, 9 p.Article

The minimal non-(≤k)-reconstructible relationsBOUDABBOUS, Youssef; LOPEZ, Gérard.Discrete mathematics. 2005, Vol 291, Num 1-3, pp 19-40, issn 0012-365X, 22 p.Article

On the maximum number of edges in a hypergraph with a unique perfect matchingBAL, Deepak; DUDEK, Andrzej; YILMA, Zelealem B et al.Discrete mathematics. 2011, Vol 311, Num 21, pp 2577-2580, issn 0012-365X, 4 p.Article

Characterizing minimally n-extendable bipartite graphsDINGJUN LOU.Discrete mathematics. 2008, Vol 308, Num 11, pp 2269-2272, issn 0012-365X, 4 p.Article

The reconstruction conjecture and edge idealsDALILI, Kia; FARIDI, Sara; TRAVES, Will et al.Discrete mathematics. 2008, Vol 308, Num 10, pp 2002-2010, issn 0012-365X, 9 p.Article

A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd orderCIUCU, Mihai.Discrete mathematics. 2007, Vol 307, Num 15, pp 1957-1960, issn 0012-365X, 4 p.Article

Some results on the spectral reconstruction problemWEI WANG; XU, Cheng-Xian.Linear algebra and its applications. 2007, Vol 427, Num 1, pp 151-159, issn 0024-3795, 9 p.Article

Full automorphism group of generalized unitary graphsWENLIU; CHANGLI MA; KAISHUN WANG et al.Linear algebra and its applications. 2012, Vol 437, Num 2, pp 684-691, issn 0024-3795, 8 p.Article

On the sextet polynomial of fullerenesSERENI, Jean-Sébastien; STEHLIK, Matĕj.Journal of mathematical chemistry. 2010, Vol 47, Num 3, pp 1121-1128, issn 0259-9791, 8 p.Article

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREEHAN, Hiêp; PERSON, Yury; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 732-748, issn 0895-4801, 17 p.Article

Paired-domination number of a graph and its complementFAVARON, O; KARAMI, H; SHEIKHOLESLAMI, S. M et al.Discrete mathematics. 2008, Vol 308, Num 24, pp 6601-6605, issn 0012-365X, 5 p.Article

Reconstructing compositionsVATTER, Vincent.Discrete mathematics. 2008, Vol 308, Num 9, pp 1524-1530, issn 0012-365X, 7 p.Article

Cancellation properties of products of graphsIMRICH, Wilfried; KLAVYAR, Sandi; RAIL, Douglas F et al.Discrete applied mathematics. 2007, Vol 155, Num 17, pp 2362-2364, issn 0166-218X, 3 p.Article

Fullerene graphs with exponentially many perfect matchingsDOSLIC, Tomislav.Journal of mathematical chemistry. 2007, Vol 41, Num 2, pp 183-192, issn 0259-9791, 10 p.Article

On the hardness of graph isomorphismTORAN, Jacobo.SIAM journal on computing (Print). 2004, Vol 33, Num 5, pp 1093-1108, issn 0097-5397, 16 p.Article

Elementary components of essentially disconnected polyomino graphsSHOULIU WEI; XIAOLING KE.Journal of mathematical chemistry. 2010, Vol 47, Num 1, pp 496-504, issn 0259-9791, 9 p.Article

Regular generalized polyomino graphsWANG, Shou-Zhong; RONG SI CHEN.Journal of mathematical chemistry. 2007, Vol 42, Num 4, pp 957-967, issn 0259-9791, 11 p.Article

A note on internally disjoint alternating paths in bipartite graphsDINGJUN LOU; SAITO, Akira; LIHUA TENG et al.Discrete mathematics. 2005, Vol 290, Num 1, pp 105-108, issn 0012-365X, 4 p.Article

A characterization of (2γ, γ_p)-treesXINMIN HOU.Discrete mathematics. 2008, Vol 308, Num 15, pp 3420-3426, issn 0012-365X, 7 p.Article

Upper bounds on the paired-domination numberCHEN, Xue-Gang; WAI CHEE SHIU; WAI HONG CHAN et al.Applied mathematics letters. 2008, Vol 21, Num 11, pp 1194-1198, issn 0893-9659, 5 p.Article

Subconstituents of orthogonal graphs of odd characteristicZHENHUA GU; WAN, Zhe-Xian.Linear algebra and its applications. 2011, Vol 434, Num 12, pp 2430-2447, issn 0024-3795, 18 p.Article

A lower bound on the number of removable ears of 1-extendable graphsSHAOHUI ZHAI; LUCCHESI, Cláudio L; XIAOFENG GUO et al.Discrete mathematics. 2010, Vol 310, Num 5, pp 1123-1126, issn 0012-365X, 4 p.Article

Distance-restricted matching extension in planar triangulationsALDRED, R. E. L; PLUMMER, Michael D.Discrete mathematics. 2010, Vol 310, Num 20, pp 2618-2636, issn 0012-365X, 19 p.Article